Swinging Types At Work

We present a number of swinging specifications with visible and/or hidden components, such as lists, sets, bags, maps, monads, streams, trees, graphs, processes, nets, classes, languages, parsers,... They provide more or less worked-out case studies and shall allow the reader to figure out the integrative power of the swinging type approach with respect to various specification and proof formalisms. For instance, the translation of algebraic nets into swinging types admits the generalization of net proof methods and thus—via a compiling graph grammar—for verifying SDL specifications. Similarly, UML class diagrams and state machines are turned into swinging types in order to make them amenable to constraint solving and proving.